factor a polynomial

См. также в других словарях:

• Polynomial factorization — In mathematics and computer algebra, polynomial factorization typically refers to factoring a polynomial into irreducible polynomials over a given field. Formulation of the questionOther factorizations, such as square free factorization exist,… …   Wikipedia

• factor — factorable, adj. factorability, n. factorship, n. /fak teuhr/, n. 1. one of the elements contributing to a particular result or situation: Poverty is only one of the factors in crime. 2. Math. one of two or more numbers, algebraic expressions, or …   Universalium

• Polynomial function theorems for zeros — are a set of theorems aiming to find (or determine the nature) of the complex zeros of a polynomial function.Found in most precalculus textbooks, these theorems include: * Remainder theorem * Factor theorem * Descartes rule of signs * Rational… …   Wikipedia

• Factor theorem — In algebra, the factor theorem is a theorem for finding out the factors of a polynomial (an expression in which the terms are only added, subtracted or multiplied, e.g. x^2 + 6x + 6). It is a special case of the polynomial remainder theorem. The… …   Wikipedia

• Polynomial long division — In algebra, polynomial long division is an algorithm for dividing a polynomial by another polynomial of the same or lower degree, a generalised version of the familiar arithmetic technique called long division. It can be done easily by hand,… …   Wikipedia

• Polynomial — In mathematics, a polynomial (from Greek poly, many and medieval Latin binomium, binomial [1] [2] [3], the word has been introduced, in Latin, by Franciscus Vieta[4]) is an expression of finite length constructed from variables (also known as… …   Wikipedia

• Polynomial remainder theorem — The polynomial remainder theorem in algebra is an application of polynomial long division. It states that the remainder, r,, of a polynomial, f(x),, divided by a linear divisor, x a,, is equal to f(a) ,.This follows from the definition of… …   Wikipedia

• Polynomial-time approximation scheme — In computer science, a polynomial time approximation scheme (abbreviated PTAS) is a type of approximation algorithm for optimization problems (most often, NP hard optimization problems).A PTAS is an algorithm which takes an instance of an… …   Wikipedia

• Polynomial interpolation — In the mathematical subfield of numerical analysis, polynomial interpolation is the interpolation of a given data set by a polynomial. In other words, given some data points (such as obtained by sampling), the aim is to find a polynomial which… …   Wikipedia

• Polynomial expansion — In mathematics, an expansion of a product of sums expresses it as a sum of products by using the fact that multiplication distributes over addition. Expansions of polynomials are obtained by multiplying together their factors, which results in a… …   Wikipedia

• Elementary symmetric polynomial — In mathematics, specifically in commutative algebra, the elementary symmetric polynomials are one type of basic building block for symmetric polynomials, in the sense that any symmetric polynomial P can be expressed as a polynomial in elementary… …   Wikipedia